package com.cloud.code.牛客网;


import java.util.Scanner;

/**
 * 给两个数字，第一个是总数n，第二个是划成多少分k，也就是把一个正整数分割成一个递增1的数组。如果划分不了就输出-1。
 */
public class Test6 {


    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int sum = scanner.nextInt();
        int sum2 = sum;
        int pease = scanner.nextInt();
        int count = 1;
        boolean flag = false;
        while (sum>0){
            sum = sum-count;
            if(sum == 0){
                flag = true;
            }
            count = count+1;
        }

        if(!flag){
            System.out.println(-1);
            return;
        }
        int count2 = 1;
        while (sum2>0){
            sum2 = sum2-count2;
            System.out.println(count2);
            count2 = count2+1;
        }


    }

}
